Coprime sampling with embedded random delays
نویسندگان
چکیده
منابع مشابه
Efficient Use of Random Delays in Embedded Software
Random delays are commonly used as a countermeasure to hinder side channel analysis and fault attacks in embedded devices. This paper proposes a different manner of generating random delays, that increases the desynchronisation compared to random delays whose lengths are uniformly distributed. It is also shown that it is possible to reduce the time lost due to the inclusion of random delays, wh...
متن کاملRate distortion performance analysis of nested sampling and coprime sampling
In this paper, rate distortion performance of nested sampling and coprime sampling is studied. It is shown that with the increasing of distortion, the data rate decreases. With these two sparse sampling algorithms, the data rate is proved to be much less than that without sparse sampling. With the increasing of sampling spacings, the data rate decreases at certain distortion, which is because w...
متن کاملRandom Sampling with Removal
Random sampling is a classical tool in constrained optimization. Under favorable conditions, the optimal solution subject to a small subset of randomly chosen constraints violates only a small subset of the remaining constraints. Here we study the following variant that we call random sampling with removal: suppose that after sampling the subset, we remove a fixed number of constraints from the...
متن کاملAn algorithm of frequency estimation for multi-channel coprime sampling
In some applications of frequency estimation, it is challenging to sample at as high as Nyquist rate due to hardware limitations. Based on conventional ESPRIT, a new method for frequency estimation with double-channel sub-Nyquist sampling is proposed. When the two undersampled multiples are relatively prime integers, partial samples are selected to estimate the frequency components contained in...
متن کاملElection algorithms with random delays in trees
The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied. The election amounts to removing leaves one by one until the tree is reduced to a unique node which is then elected. The algorithm assigns to each leaf a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2019
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2019.01.007